Data Complexity of Reasoning in Very Expressive Description Logics
نویسندگان
چکیده
Data complexity of reasoning in description logics (DLs) estimates the performance of reasoning algorithms measured in the size of the ABox only. We show that, even for the very expressive DL SHIQ, satisfiability checking is data complete for NP. For applications with large ABoxes, this can be a more accurate estimate than the usually considered combined complexity, which is EXPTIMEcomplete. Furthermore, we identify an expressive fragment, Horn-SHIQ, which is data complete for P, thus being very appealing for practical usage.
منابع مشابه
The Combined Complexity of Reasoning with Closed Predicates in Description Logics
We investigate the computational cost of combining the open and closed world assumptions in Description Logics. Unlike previous works, which have considered data complexity and focused mostly on lightweight DLs, we study combined complexity for a wide range of DLs, from lightweight to very expressive ones. From existing results for the standard setting, where all predicates are interpreted unde...
متن کاملReasoning and Query Answering in Description Logics
Description Logics (DLs) play a central role as formalisms for representing ontologies and reasoning about them. This lecture introduces the basics of DLs. We discuss the knowledge modeling capabilities of some of the most prominent DLs, including expressive ones, and present some DL reasoning services. Particular attention is devoted to the query answering problem, and to the increasingly popu...
متن کاملTowards ABox Modularization of semi-expressive Description Logics
In the last years, the vision of the Semantic Web fostered the interest in reasoning over large and very large sets of assertional statements in knowledge bases. Traditional tableau-based reasoning systems perform bad answering queries over large data sets, because these reasoning systems are based on efficient use of main memory data structures. Increasing expressivity and worstcase complexity...
متن کاملFinite Model Reasoning in Horn Description Logics
We study finite model reasoning in expressive Horn description logics (DLs), starting with a reduction of finite ABox consistency to unrestricted ABox consistency. The reduction relies on reversing certain cycles in the TBox, an approach that originated in database theory, was later adapted to the inexpressive DL DL-LiteF , and is shown here to extend to the expressive Horn DL Horn-ALCFI. The m...
متن کاملFrom OWL to DL - Lite through Efficient Ontology Approximation
Ontologies provide a conceptualization of a domain of interest which can be used for different objectives, such as for providing a formal description of the domain of interest for documentation purposes, or for providing a mechanism for reasoning upon the domain. For instance, they are the core element of the Ontology-Based Data Access (OBDA) [3,8] paradigm, in which the ontology is utilized as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005